﻿#region Copyright (c) 2003 - 2008, Andreas Mueller
/////////////////////////////////////////////////////////////////////////////////////////
// 
// Copyright (c) 2003 - 2008, Andreas Mueller.
// All rights reserved. This program and the accompanying materials
// are made available under the terms of the Eclipse Public License v1.0
// which accompanies this distribution, and is available at
// http://www.eclipse.org/legal/epl-v10.html
//
// Contributors:
//    Andreas Mueller - initial API and implementation
//
// 
// This software is derived from software bearing the following
// restrictions:
// 
// Copyright (c) 1994
// Hewlett-Packard Company
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Hewlett-Packard Company makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// Copyright (c) 1996,1997
// Silicon Graphics Computer Systems, Inc.
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Silicon Graphics makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// (C) Copyright Nicolai M. Josuttis 1999.
// Permission to copy, use, modify, sell and distribute this software
// is granted provided this copyright notice appears in all copies.
// This software is provided "as is" without express or implied
// warranty, and with no claim as to its suitability for any purpose.
// 
/////////////////////////////////////////////////////////////////////////////////////////
#endregion


using NUnit.Framework;
using NStl.Collections;
using NUnit.Framework.SyntaxHelpers;
using System.Collections.Generic;

namespace NStl.NUnit.ContainerFixture.HashSet
{
    [TestFixture]
    public class InsertFixture
    {
        [Test]
        public void Insert()
        {
            HashSet<int> m = new HashSet<int>();

            KeyValuePair<HashSet<int>.Iterator, bool> rv = m.Insert(0);

            Assert.That(rv.Value, Is.True);
            Assert.That(rv.Key.Value, Is.EqualTo(0));
            Assert.That(m, Has.Member(0));
        }
        [Test]
        public void InsertDuplicateKey()
        {
            HashSet<int> m = new HashSet<int>(0);

            KeyValuePair<HashSet<int>.Iterator, bool> rv = m.Insert(0);

            Assert.That(rv.Value, Is.False);
            Assert.That(rv.Key.Value, Is.EqualTo(0));
            Assert.That(m, Has.Member(0));
        }
        [Test]
        public void InsertKeyWithKeyIsNull()
        {
            HashSet<string> m = new HashSet<string>();
            m.Insert(null);

            Assert.That(m, Is.EqualTo(new object[] { null }));
        }
        
        [Test]
        public void InsertRange()
        {
            Vector<int> data = new Vector<int>(0, 1, 2, 3, 7);
            Algorithm.RandomShuffle(data.Begin(), data.End());

            Vector<int> toInsert = new Vector<int>(4, 5, 6);

            Vector<int> expected = new Vector<int>(data);

            HashSet<int> m = new HashSet<int>(data);


            m.Insert(toInsert.Begin(), toInsert.End());

            expected.PushBackRange(toInsert);

            Assert.That(m, Is.EquivalentTo(expected));
        }
    }
}
